Computing the variance of a conditional expectation via non-nested Monte Carlo
نویسندگان
چکیده
منابع مشابه
Automatic Backward Differentiation for American Monte-Carlo Algorithms (Conditional Expectation)
In this note we derive the backward (automatic) differentiation (adjoint [automatic] differentiation) for an algorithm containing a conditional expectation operator. As an example we consider the backward algorithm as it is used in Bermudan product valuation, but the method is applicable in full generality. The method relies on three simple properties: 1. a forward or backward (automatic) diffe...
متن کاملEfficient Nested Simulation for Estimating the Variance of a Conditional Expectation
In a two-level nested simulation, an outer level of simulation samples scenarios, while the inner level uses simulation to estimate a conditional expectation given the scenario. Applications include financial risk management, assessing the effects of simulation input uncertainty, and computing the expected value of gathering more information in decision theory. We show that an ANOVA-like estima...
متن کاملNested Monte-Carlo Search
Many problems have a huge state space and no good heuristic to order moves so as to guide the search toward the best positions. Random games can be used to score positions and evaluate their interest. Random games can also be improved using random games to choose a move to try at each step of a game. Nested Monte-Carlo Search addresses the problem of guiding the search toward better states when...
متن کاملLearning Sigmoid Belief Networks via Monte Carlo Expectation Maximization
Belief networks are commonly used generative models of data, but require expensive posterior estimation to train and test the model. Learning typically proceeds by posterior sampling, variational approximations, or recognition networks, combined with stochastic optimization. We propose using an online Monte Carlo expectationmaximization (MCEM) algorithm to learn the maximum a posteriori (MAP) e...
متن کاملNested Monte-Carlo Expression Discovery
Nested Monte-Carlo search is a general algorithm that gives good results in single player games. Genetic Programming evaluates and combines trees to discover expressions that maximize a given evaluation function. In this paper Nested Monte-Carlo Search is used to generate expressions that are evaluated in the same way as in Genetic Programming. Single player Nested Monte-Carlo Search is transfo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2017
ISSN: 0167-6377
DOI: 10.1016/j.orl.2016.12.002